By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 29, Issue 2, pp. 351-695

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Solvability in Asynchronous Environments II: Finite Interactive Tasks

Benny Chor and Lee-Bath Nelson

pp. 351-377

BibTeX  Abstract Full Text:  PDF

Weakly Triangulated Comparability Graphs

Elaine Eschen, Ryan B. Hayward, Jeremy Spinrad, and R. Sritharan

pp. 378-386

BibTeX  Abstract Full Text:  PDF

On Approximately Counting Colorings of Small Degree Graphs

Russ Bubley, Martin Dyer, Catherine Greenhill, and Mark Jerrum

pp. 387-400

BibTeX  Abstract Full Text:  PDF

Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited

Stephen J. Bellantoni and Karl-Heinz Niggl

pp. 401-415

BibTeX  Abstract Full Text:  PDF

Communication-Efficient Parallel Sorting

Michael T. Goodrich

pp. 416-432

BibTeX  Abstract Full Text:  PDF

Proximity in Arrangements of Algebraic Sets

J. H. Rieger

pp. 433-458

BibTeX  Abstract Full Text:  PDF

Better Bounds for Online Scheduling

Susanne Albers

pp. 459-473

BibTeX  Abstract Full Text:  PDF

Tight Bounds for On-Line Tree Embeddings

Sandeep Bhatt, David Greenberg, Tom Leighton, and Pangfeng Liu

pp. 474-491

BibTeX  Abstract Full Text:  PDF

A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem

David R. Karger

pp. 492-514

BibTeX  Abstract Full Text:  PDF

On the Maximum Scatter Traveling Salesperson Problem

Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven S. Skiena, and Tae-Cheon Yang

pp. 515-544

BibTeX  Abstract Full Text:  PDF

The Parametrized Complexity of Some Fundamental Problems in Coding Theory

Rod G. Downey, Michael R. Fellows, Alexander Vardy, and Geoff Whittle

pp. 545-570

BibTeX  Abstract Full Text:  PDF

Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time

Juha Kärkkäinen and Esko Ukkonen

pp. 571-589

BibTeX  Abstract Full Text:  PDF

Kolmogorov Random Graphs and the Incompressibility Method

Harry Buhrman, Ming Li, John Tromp, and Paul Vitányi

pp. 590-599

BibTeX  Abstract Full Text:  PDF

Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

Steven C. Bruell, Sukumar Ghosh, Mehmet Hakan Karaata, and Sriram V. Pemmaraju

pp. 600-614

BibTeX  Abstract Full Text:  PDF

Automatic Methods for Hiding Latency in Parallel and Distributed Computation

Matthew Andrews, Tom Leighton, P. Takis Metaxas, and Lisa Zhang

pp. 615-647

BibTeX  Abstract Full Text:  PDF

Improved Approximation Guarantees for Packing and Covering Integer Programs

Aravind Srinivasan

pp. 648-670

BibTeX  Abstract Full Text:  PDF

An Efficient Algorithm for Generating Necklaces with Fixed Density

Frank Ruskey and Joe Sawada

pp. 671-684

BibTeX  Abstract Full Text:  PDF

Finding an Even Simple Path in a Directed Planar Graph

Zhivko Prodanov Nedev

pp. 685-695

BibTeX  Abstract Full Text:  PDF